Decomposition of Km,n(Km,n∗) into cycles (circuits) of length 2k

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

a study of translation of english litrary terms into persian

چکیده هدف از پژوهش حاضر بررسی ترجمه ی واژه های تخصصی حوزه ی ادبیات به منظور کاوش در زمینه ی ترجمه پذیری آنها و نیز راهکار های به کار رفته توسط سه مترجم فارسی زبان :سیامک بابایی(1386)، سیما داد(1378)،و سعید سبزیان(1384) است. هدف دیگر این مطالعه تحقیق در مورد روش های واژه سازی به کار رفته در ارائه معادل های فارسی واژه های ادبی می باشد. در راستای این اهداف،چارچوب نظری این پژوهش راهکارهای ترجمه ار...

15 صفحه اول

Decomposition of Circulants into Antidirected Hamilton Cycles

Let G = Gn(a1, a2, ..., ak) denote a directed circulant graph of order n with k pairwise distinct jumps [1]. Antidirected Hamilton cycle in G is a cycle of n arcs that does not contain induced directed path P2. Let C 1 G, C 2 G, ..., C k G be pairwise arc-disjoint antidirected Hamilton cycles in G, each composed of exactly two distinct jumps. We give the necessary and sufficient conditions for ...

متن کامل

Decomposition of graphs into cycles of length seven and single edges

Given graphs G and H , an H-decomposition of G is a partition of the edge set of G such that each part is either a single edge or forms a graph isomorphic to H . Let φH(n) be the smallest number φ such that any graph G of order n admits an H-decomposition with at most φ parts. Here we study the case when H = C7, that is, the cycle of length 7 and prove that φC7(n) = n/4 for all n ≥ 10.

متن کامل

Almost resolvable decompositions of 2Kn into cycles of odd length

The complete graph on n vertices is denoted by K, and the graph on n vertices in which each pair of vertices is joined by exactly 2 edges is denoted by 2K,. An m-cycle is a sequence of m distinct vertices (u1, u2, . . . . u,) such that ui is adjacent to ui+ 1 and U, is adjacent to u1 . A spanning subgraph H of G is a subgraph for which V(H) = V(G). An i-factor of a graph G is a spanning subgrap...

متن کامل

the effects of integrating cooperative learning into vocabulary learning of elementary school students

the purpose of the research is to examine if integrating cooperative learning into vocabulary learning helps to increase word recognition of students in an elementary school in iran. it tries to investigate whether cooperative learning approach enables students to improve their language learning. this research used stad (students team achievement division) as a cooperative model in this study. ...

15 صفحه اول

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Combinatorial Theory, Series B

سال: 1981

ISSN: 0095-8956

DOI: 10.1016/0095-8956(81)90093-9